Predicting the Shrinking Generator with Fixed Connections
نویسندگان
چکیده
We propose a novel distinguishing attack on the shrinking generator with known feedback polynomial for the generating LFSR. The attack can e.g. reliably distinguish a shrinking generator with a weight 4 polynomial of degree as large as 10000, using 2 output bits. As the feedback polynomial of an arbitrary LFSR is known to have a polynomial multiple of low weight, our distinguisher applies to arbitrary shrunken LFSR’s of moderate length. The analysis can also be used to predict the distribution of blocks in the generated keystream.
منابع مشابه
A Fast Correlation Attack on the Shrinking Generator
In this paper we demonstrate a fast correlation attack on the shrinking generator with known connections. Our attack is applicable to arbitrary weight feedback polynomial of the generating LFSR and comparisons with other known attacks show that our attack offers good trade-offs between required keystream length, success probability and complexity. Our result confirms Golić’s conjecture that the...
متن کامل- 1 - Balanced Shrinking Generators
The shrinking generator is a keystream generator which is good for stream ciphers in wireless mobile communications, because it has simple structure and generates a keystream faster than other generators. Nevertheless, it has a serious disadvantage that its keystream is not balanced if they use primitive polynomials as their feedback polynomials. In this paper, we present a method to construct ...
متن کاملAn Improved Attack on the Shrinking Generator
This work proposes a known-plaintext attack on the Shrinking Generator through its characterization by means of Cellular Automata. It is based on the computation of the characteristic polynomials of sub-automata and on the generation of the Galois field associated to one of the Linear Feedback Shift Registers components of the generator. The proposed algorithm allows predicting a large number o...
متن کاملUsing Linear Hybrid Cellular Automata to Attack the Shrinking Generator
SUMMARY The aim of this research is the efficient cryptanalysis of the Shrinking Generator through its characterization by means of Linear Hybrid Cellular Automata. This paper describes a new known-plaintext attack based on the computation of the characteristic polynomials of sub-automata and on the generation of the Galois field associated to one of the Linear Feedback Shift Registers componen...
متن کاملThe Probability Model of the Multi-valued Shrinking Generator
This paper constructs the probability model of the general multi-valued shrinking generator, which takes two-valued key stream shrinking generator and generalized shrinking generator as special cases. It discusses the probability properties of their output sequences, and gets the formulae of the coincidence of the output sequences with the original input sequences in particular. It also analyze...
متن کامل